Optimization Algorithms for Student Scheduling via Constraint Satisfiability
نویسندگان
چکیده
منابع مشابه
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these variables. A solution to the CSP is an instantiation (or labeling) of all the variables which does not violate any of the constraints. Since constraint satisfiability problems are, in general, NP-complete, it is of interes...
متن کاملScheduling algorithms for workflow optimization
Pipelined workflows are a popular programming paradigm for parallel applications. In these workflows, the computation is divided into several stages and these stages are connected to each other through first-in first-out channels. In order to execute these workflows on a parallel machine, we must first determine the mapping of the stages onto the various processors on the machine. After finding...
متن کاملRestrictions for OCL Constraint Optimization Algorithms
Efficient constraint handling is essential in UML, in metamodeling, and also in model transformation. OCL is a popular, textual formal language that is used in most of the modeling frameworks to express constraints. Our research focuses on the optimization of OCL handling. Previous works have presented algorithms that can accelerate the constraint validation by rewriting and decomposing the con...
متن کاملMeasuring Distributed Constraint Optimization algorithms
Complete algorithms for solving DisCOPs have been a major focus of research in the DCR community in the last few years. The properties of these algorithms belong to very different categories. Algorithms differ by their degree of asynchronicity, by the method of their combinatorial part, and by dividing the problem into sub parts. The wide variety of different families of algorithms makes it har...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1990
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/33.4.356